Logical Relations for PCF
نویسنده
چکیده
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the literature. We show that the Y combinator coincides with the domaintheoretic fixpoint operator, that parallel-or and the Plotkin existential are not definable in PCF, that the continuation semantics for PCF coincides with the direct semantics, and that our domain-theoretic semantics for PCF is adequate for reasoning about contextual equivalence in an operational semantics. Our version of PCF is untyped and has both strict and non-strict function abstractions. The development is carried out in HOLCF.
منابع مشابه
Kripke Logical Relations and PCF
Sieber has described a model of PCF consisting of continuous functions that are invariant under certain ((nitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of \Kripke logical relations" introduced by Jung and Tiuryn to characterize-deenability.
متن کاملPcf Deenability via Kripke Logical Relations (after O'hearn and Riecke)
The material presented here is an exposition of an application of logical relations to the problem of full abstraction for PCF. The point is to see Kripke logical relations as introduced by Jung and Tiuryn in [5] and used by O'Hearn and Riecke in [6] to give a logical characterization of sequentiality, within the mainstream of the classical notion of logical relations. The main di erence with r...
متن کاملProgram equivalence in linear contexts
Program equivalence in linear contexts, where programs are used or executed exactly once, is an important issue in programming languages. However, existing techniques like those based on bisimulations and logical relations only target at contextual equivalence in the usual (non-linear) functional languages, and fail in capturing non-trivial equivalent programs in linear contexts, particularly w...
متن کاملA Comparative Study of Multipole and Empirical Relations Methods for Effective Index and Dispersion Calculations of Silica-Based Photonic Crystal Fibers
In this paper, we present a solid-core Silica-based photonic crystal fiber (PCF) composed of hexagonal lattice of air-holes and calculate the effective index and chromatic dispersion of PCF for different physical parameters using the empirical relations method (ERM). These results are compared with the data obtained from the conventional multipole method (MPM). Our simulation results reveal tha...
متن کاملLogical Full Abstraction and PCF
We introduce the concept of logical full abstraction, generalising the usual equational notion. We consider the language PCF and two extensions with “parallel” operations. The main result is that, for standard interpretations, logical full abstraction is equivalent to equational full abstraction together with universality; the proof involves constructing enumeration operators. We also consider ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012